Algorithms , Probability , and Computing Solutions KW 41 HS 17 Solution of In - Class Exercise 1 : Lines Intersecting Segment
نویسندگان
چکیده
Solution of In-Class Exercise 1: Lines Intersecting Segment Let s be a line segment in the plane R, and let u, v 2 R be the two endpoints that delimit it. Let furthermore L be the set of all non-vertical lines l that intersect s. A simple characterization of L would be that any non-veritcal line l is contained in L if and only if one of the following occurs: (i) l contains u or (ii) l contains v or (iii) u lies above l and v lies below l or (iv) v lies above l and u lies below l. In the dual space, u and v are two xed lines and we are looking for the set of points L corresponding to the duals of all lines in L. According to Observation 2.3 and the preceding discussion, the above criteria for l hitting the segment s are satis ed if and only if in the dual, (i') l lies on u (incidence) or (ii') l lies on v (incidence) or (iii') l lies above u and l lies below v (2.3) or (iv') l lies above v and l lies below u (2.3) So the space L we are looking for consists of four regions de ned by these criteria. The following picture shows what those regions typically look like. On the left, the primal space is shown, containing a line segment s and several lines f, g, h intersecting s in exactly one point, where on the right their duals are shown. Here `s is the line going through the endpoints u and v. The set of points L consists of the two lines u and v as well as all points in the left wedge that have u above and v below (region (iv')) and all points in the right wedge that have v above and u below (region (iii')).
منابع مشابه
Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملP-brane Black Holes for General Intersections
Black hole generalized p -brane solutions for a wide class of intersection rules are presented. The solutions are defined on a manifold that contains a product of n−1 Ricci-flat internal spaces. They are defined up to moduli functions Hs = Hs(R) obeying a non-linear differential equations (equivalent to Toda-type equations) with certain boundary conditions imposed. Using conjecture on polynomia...
متن کاملar X iv : h ep - t h / 98 03 00 6 v 2 1 4 M ay 1 99 9 HYPERBOLIC KAC - MOODY ALGEBRA FROM INTERSECTING P - BRANES
A subclass of recently discovered class of solutions in multidimensional gravity with intersecting p-branes related to Lie algebras and governed by a set of harmonic functions is considered. This subclass in case of three Euclidean p-branes (one electric and two magnetic) contains a cosmological solution to D = 11 supergravity related to hyperbolic Kac-Moody algebra F 3 (of rank 3). This soluti...
متن کاملTunnel Rehabilitation in Fault Zone Using Sequential Joints Method- Case Study: Karaj Water Conveyance Tunnel
The lining structure of Tunnel Boring Machine (TBM) excavated tunnels is composed of series of precast Reinforced Concrete (RC) pieces which are called segment. At the present paper, a novel method is introduced for seismic retrofitting of segmental tunnels located at active fault zones in rock environment with case study of Amirkabir dam to Tehran water transfer tunnel (Karadj tunnel). The mai...
متن کاملProbabilistic Harmony Search
Harmony Search (HS) is a new meta-heuristic algorithm imitating the music improvisation process where musicians search for a better state of harmony. In this paper, a new improvisation scheme is proposed that explicitly uses a probabilistic model of candidate solutions stored in the harmony memory. Pitch adjustment uses a probability distribution to mutate a decision variable while random selec...
متن کامل